A game semantics for proof search: preliminary results
نویسندگان
چکیده
Outline 1. A neutral approach to proof and refutation.
منابع مشابه
A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics
Recently, Argumentation Mechanism Design (ArgMD) was introduced as a new paradigm for studying argumentation among self-interested agents using game-theoretic techniques. Preliminary results showed a condition under which a direct mechanism based on Dung’s grounded semantics is strategy-proof (i.e. truth enforcing). But these early results dealt with a highly restricted form of agent preference...
متن کاملCompleteness Proofs for Linear Logic Based on the Proof Search Method (Preliminary Report)
The proof search method is a traditionally established way to prove the completeness theorem for various logics. The purpose of this paper is to show that this method can be adapted to linear logic. First we prove the completeness theorem for a certain fragment of intuitionistic linear logic, called naive linear logic, with respect to naive phase semantics, i.e., phase semantics without any clo...
متن کاملHierarchical Fuzzy Clustering Semantics (HFCS) in Web Document for Discovering Latent Semantics
This paper discusses about the future of the World Wide Web development, called Semantic Web. Undoubtedly, Web service is one of the most important services on the Internet, which has had the greatest impact on the generalization of the Internet in human societies. Internet penetration has been an effective factor in growth of the volume of information on the Web. The massive growth of informat...
متن کاملDesequentialization of Games and Experiments on Proof-nets
We study the comparison of dynamic semantics (games, dealing with interactions) with static semantics (dealing with results of interactions), in the spirit of Timeless Games [2]. We carefully analyze Laurent’s polarized proof-nets (which for the game semantics is full and faithful [8]) and we detail the precise correspondence between cut free proof-nets and innocent strategies, in a framework r...
متن کاملA Game Semantics for System P (Extended Version)
In this paper we introduce a game semantics for System P, one of the most studied axiomatic systems for non-monotonic reasoning, conditional logic and belief revision. We prove soundness and completeness of the game semantics with respect to the rules of System P, and show that an inference is valid with respect to the game semantics if and only if it is valid with respect to the standard order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005